Using the Davis and Putnam procedure for ane cient computation of preferred
نویسندگان
چکیده
Some famous problems (ATMS inference, Closed World Reasoning (CWR) for instance) can be replaced by a problem of preferred model computation. We thus propose a preference relation between models based on a preference relation between literals and an \eecient" algorithm to compute the associated preferred models of a theory. Then, we apply this algorithm to ATMS inference and problems of CWR. Sub-problems like subsumption and label computation 7]]8] are thus implicitly solved.
منابع مشابه
Decision-theoretic diagnosis and repair: representational and computational issues
In this paper, we propose an original approach to diagnosis and repair based on label computation in ATMS, where assumptions are either usual abnormality assumptions, or repair-action assumptions, or goal assumptions. We assign probabilities to component failures and utilities to gradual goals. Then we give an algorithm using an original method (based on the Davis and Putnam procedure) for comp...
متن کاملResolution Theorem Proving
Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson in the early 1960's to accelerate rst order inference Robinson, 1965]. A complete inference procedure had been done by Martin Davis and Hillary Putnam a few years prior to Robinson's work Davis and Putnam, 1960]. Unfortunately, it was a ground procedure and suuered f...
متن کاملTo Guess or to Think? Hybrid Algorithms for SAT
Complete algorithms for solving propositional satis ability fall into twomain classes: backtracking (e.g., the Davis-Putnam Procedure [4]) and resolution (e.g., Directional Resolution [9]). Roughly speaking, backtracking amounts to \guessing" (making assumption), while resolution invokes \thinking" (inference). Experimental results show that both \pure guessing" and \pure thinking" might be ine...
متن کاملTo Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract)
Complete algorithms for solving propositional satis ability fall into two main classes: backtracking search (e.g., the Davis-Putnam Procedure [1]) and resolution (e.g., Directional Resolution [4]). Backtracking may be viewed as a systematic \guessing" of variable assignments, while resolution invokes making inferences, i.e. \thinking". Experimental results show that \pure guessing" or \pure thi...
متن کاملJu n 20 02 Restart method and exponential acceleration of random 3 - SAT instances resolutions : a large deviation analysis of the Davis – Putnam – Loveland – Logemann algorithm
The analysis of the solving complexity of random 3-SAT instances using the Davis-Putnam-Loveland-Logemann (DPLL) algorithm slightly below threshold is presented. While finding a solution for such instances demands exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. We compu...
متن کامل